1179B - Tolik and His Uncle - CodeForces Solution

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <functional>
#include <unordered_map>
#include <climits>
#include <unordered_set>

using namespace std;

typedef long long LL;

typedef pair<int, int> PII;
typedef vector<PII> PIIL;

class CF1179B {
public:
    void solve(int R, int C) {
        // PIIL ans;

        for (int top = 1, bottom = R; top < bottom; top++, bottom--) {
            // (top, 1) -> ... -> (bottom, 1)
            for (int i = 0, r = top, c = 1; i < C * 2; i++) {
                printf("%d %d\n", r, c);
                r = top + bottom - r;
                c += ((i % 2 == 0) ? 1 : -1) * (C - i - 1);
            }
        }

        if (R & 1) {
            int r = (R + 1) / 2;
            for (int i = 0, c = 1; i < C; i++) {printf("%d %d\n", r, c);
                c += ((i % 2 == 0) ? 1 : -1) * (C - i - 1);
            }
        }
        return;
    }
};

int main() {
    int n, m;
    scanf("%d%d", &n, &m);
    CF1179B().solve(n, m);
//    for (auto p : CF1179B().solve(n, m)) {
//        printf("%d %d\n", p.first, p.second);
//    }
    return 0;
}